factorization into prime numbers

factorization into prime numbers
分解成质因数(法)

English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • prime decomposition — noun The factorization of an integer into prime numbers. Syn: prime factorization …   Wiktionary

  • Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… …   Wikipedia

  • Prime factor — In number theory, the prime factors of a positive integer are the prime numbers that divide into that integer exactly, without leaving a remainder. The process of finding these numbers is called integer factorization, or prime factorization.For a …   Wikipedia

  • Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia

  • prime factorization — noun The factorization of a positive integer into its constituent prime numbers Syn: integer factorization, prime decomposition …   Wiktionary

  • prime — I. noun Etymology: Middle English, from Old English prīm, from Latin prima hora first hour Date: before 12th century 1. a. often capitalized the second of the canonical hours b. the first hour of the day usually considered either as 6 a.m. or the …   New Collegiate Dictionary

  • Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… …   Wikipedia

  • Unique factorization domain — In mathematics, a unique factorization domain (UFD) is, roughly speaking, a commutative ring in which every element, with special exceptions, can be uniquely written as a product of prime elements, analogous to the fundamental theorem of… …   Wikipedia

  • RSA numbers — In mathematics, the RSA numbers are a set of large semiprimes (numbers with exactly two prime factors) that are part of the RSA Factoring Challenge. The challenge was to find the prime factors but it was declared inactive in 2007. [RSA… …   Wikipedia

  • Euler's factorization method — is a method of factorization based upon representing a positive integer N as the sum of two squares in two different ways :N = a^2+ b^2 = c^2+ d^2 (1)Although the algebraic factorization of binomial numbers cannot factor sums of two squares… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”